Prediction of Random PCR Products and Its Inverse Problem
نویسندگان
چکیده
Prediction programs for general PCR (or random PCR) products had been developed [3, 2]. These programs had been experimentally shown to be highly accurate in its prediction [2]. On the other hand, random PCR have been demonstrating that it is very useful as an elementary technology of genome profiling [1], in which random PCR products (a set of DNA fragments extracted from various parts of genomic DNA) are subjected to TGGE (temperature gradient gel electrophoresis), generating a set of characteristic band patterns (see Fig. 1), for identification of species [4]. So far as the identification of species is concerned, any sequence of primer is usable for genome profiling (GP). However, in some cases availability of a particular DNA fragment of known sequence makes GP analysis highly informative as in the case where the verotoxin genome responsible for HUS (Haemolytic Uraemic Syndrome) is contained in the genome of a test strain of E. coli. For this purpose, the single probe oligonucleotide used for random PCR should be designed to be able to replicate a particular sequence such as a verotoxin and a 16S rRNA genes. This constitutes an ‘inverse random PCR problem’, of which the normal one is to find the products specified by an oligonucleotide.
منابع مشابه
Solving random inverse heat conduction problems using PSO and genetic algorithms
The main purpose of this paper is to solve an inverse random differential equation problem using evolutionary algorithms. Particle Swarm Algorithm and Genetic Algorithm are two algorithms that are used in this paper. In this paper, we solve the inverse problem by solving the inverse random differential equation using Crank-Nicholson's method. Then, using the particle swarm optimization algorith...
متن کاملOptimal Non-Parametric Prediction Intervals for Order Statistics with Random Sample Size
In many experiments, such as biology and quality control problems, sample size cannot always be considered as a constant value. Therefore, the problem of predicting future data when the sample size is an integer-valued random variable can be an important issue. This paper describes the prediction problem of future order statistics based on upper and lower records. Two different cases for the ...
متن کاملInverse nodal problem for p-Laplacian with two potential functions
In this study, inverse nodal problem is solved for the p-Laplacian operator with two potential functions. We present some asymptotic formulas which have been proved in [17,18] for the eigenvalues, nodal points and nodal lengths, provided that a potential function is unknown. Then, using the nodal points we reconstruct the potential function and its derivatives. We also introduce a solution of i...
متن کاملOn the nonnegative inverse eigenvalue problem of traditional matrices
In this paper, at first for a given set of real or complex numbers $sigma$ with nonnegative summation, we introduce some special conditions that with them there is no nonnegative tridiagonal matrix in which $sigma$ is its spectrum. In continue we present some conditions for existence such nonnegative tridiagonal matrices.
متن کاملDetect and Eliminate Congestion of the Intermediate Products in Supply Chain
Data envelopment analysis (DEA) is a nonparametric technique that includes models to evaluate the relative efficiency of Decision Making Units (DMUs). It has the ability to separate efficient units and inefficient units. One of the applications of this mathematical technique is evaluating performance of supply chain. According to such as the inefficiency factors of one DMU, is existence conges...
متن کامل